An Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems
Authors
Abstract:
In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence under mild assumptions. Using a collection of CUTEr problems, the method is compared with some existing algorithms to show its effectiveness.
similar resources
A new hybrid conjugate gradient algorithm for unconstrained optimization
In this paper, a new hybrid conjugate gradient algorithm is proposed for solving unconstrained optimization problems. This new method can generate sufficient descent directions unrelated to any line search. Moreover, the global convergence of the proposed method is proved under the Wolfe line search. Numerical experiments are also presented to show the efficiency of the proposed algorithm, espe...
full textA New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The globa...
full textOpen Problems in Nonlinear Conjugate Gradient Algorithms for Unconstrained Optimization
The paper presents some open problems associated to the nonlinear conjugate gradient algorithms for unconstrained optimization. Mainly, these problems refer to the initial direction, the conjugacy condition, the step length computation, new formula for conjugate gradient parameter computation based on function’s values, the influence of accuracy of line search procedure, how we can take the pro...
full textA Conjugate Gradient Method for Unconstrained Optimization Problems
A hybrid method combining the FR conjugate gradient method and the WYL conjugate gradient method is proposed for unconstrained optimization problems. The presented method possesses the sufficient descent property under the strong Wolfe-Powell SWP line search rule relaxing the parameter σ < 1. Under the suitable conditions, the global convergence with the SWP line search rule and the weak Wolfe-...
full textAnother nonlinear conjugate gradient algorithm for unconstrained optimization
A nonlinear conjugate gradient algorithm which is a modification of the Dai and Yuan [Y.H. Dai and Y, Yuan, A nonlinear conjugate gradient method with a strong global convergence property, SIAM J. Optim., 10 (1999), pp.177-182.] conjugate gradient algorithm satisfying a parametrized sufficient descent condition with a parameter k δ is proposed. The parameter k δ is computed by means of the conj...
full textAn accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization
In this paper we suggest a new conjugate gradient algorithm that for all both the descent and the conjugacy conditions are guaranteed. The search direction is selected as a linear combination of 0 k ≥ 1 k g + − and where , k s 1 1 ( ) k k g f x + + = ∇ , and the coefficients in this linear combination are selected in such a way that both the descent and the conjugacy condition are satisfied at ...
full textMy Resources
Journal title
volume 19 issue 1
pages 1- 16
publication date 2022-03
By following a journal you will be notified via email when a new issue of this journal is published.
No Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023